COMMENT ⊗   VALID 00005 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.BEGIN TURN ON "|","$"
C00024 00003	.ref([MAC#74],|Bogen, R., 
C00037 00004	.ref([Sam#75],|Samet, H., 
C00043 00005	.ref([Wad#71], |Wadsworth, C., 
C00048 ENDMK
C⊗;
.BEGIN TURN ON "|","$";
.ref([Aho#72], |Aho, A., and Ullman, J., 
. $The Theory of Parsing, Translation & Compiling$, 
. Prentice Hall Inc., Englewood Cliffs, N.J., 1972.|)

.ref([Alg#63], |Nauer, P. et. al., 
. `Revised Report on the Algorithmic Language Algol 60', 
. $Comm.#ACM#6$, %21%1, Jan.,#1963.|)

.ref([Alg#75], |van Wijngaarden, A., et. al., eds., 
. `Revised Report on the Algorithmic Language Algol#68', 
. $Acta Informatica$, Vol.#5, Fac.#1-3, p.#1-236, 1975.|)

.ref([And#76a], |Anderson, D. Bruce, 
. `The Samefringe Problem', 
. $SIGART Newsletter$, No.#60, p.#4, Nov.#1976.|)

.ref([And#76], |Anderson, D. Bruce,
. `A Brief Critique of LISP', 
. Proc. AISB Summer Conference, Edinburgh, p.#14-25, 1976.|)

.ref([Bac#73], |Backus, J., 
. `Programming Language Semantics and Closed Applicative Languages', 
. IBM Research Lab, RJ-1245, San Jose, Cal., July#1973.|)

.ref([Bar#71], |Barbacci, M., et al.,
. `C.ai#(P.LISP), A LISP processor of C.ai', 
. Carnegie-Mellon U., 1971.|)

.ref([Bar#66],|Barron, D., and Strachey, C.,
. `Programming', 
. in $Advances in Computer Programming and Non-numerical Computation$,
. #L.#Fox, ed., p.#49-82, 1966.|)

.ref([Bau#72],|Baumgart, B., 
. `MICRO-PLANNER Alternative Reference Manual', 
. Stanford Univ. Operating Note No.#67, April 1972.|)

.ref([Ber#64], |Berkeley, E., and Bobrow, D., eds., 
. $The Programming Language LISP:#Its Operation and Applications$, 
. Information International, Cambridge, Mass., 1964.|)

.ref([Ber#71], |Berkling, H., 
. `A Computing Machine Based on Tree Structures', 
. $IEEE Trans on Comptr.$ 20, C-20, %24%1, p.#404-418, April#1971.|)

.ref([Berr#71], |Berry, D., 
. `Block Structure:#Retention or Deletion?', 
. Proc. of 3%8rd%1 Annual ACM Symposium on Theory of Computing, p.#86-100, 1971.|)

.ref([Bis#74],|Bishop, P., 
. `Spaghetti Stacks', 
. unpublished paper, M.I.T., Dec#19,#1974.|)

.ref([Bis#74a],|Bishop, P., 
. `Garbage Collection in a Very Large Address Space', 
. M.I.T.#A.I.#Lab, Working paper#111, Sep.#1975.|)

.REF([Bla#71],|Blair, F., 
. `The Structure of the Lisp Compiler', 
. unpublished paper, 1971.|)

.ref([Bob#73a], |Bobrow, D., and Wegbreit, B., 
. `A Model and Stack Implementation of Multiple Environments',
. $Comm.#ACM#16$, %210%1, p.#591-603, Oct.#1973.|)

.ref([Bob#75], |Bobrow, D., 
. `A Note on Hash Linking', 
. $Comm.#ACM#18$, %27%1, p.#413-414, July,#1975.|)

.ref([Bob#69], |Bobrow, D., 
. `(LISP Bulletin)', 
. $ACM Sigplan Notices$, Vol.#1, No.#9, p.#17-45, Sept.#1969.|)

.ref([Bob#74],|Bobrow, D., and Raphael, D., 
. `New Programming Languages for A.I. Research', 
. $Computing Surveys, 6$, %23%1, p.#154-174, Sep#1974.|)

.ref([Bob#67],|Bobrow, D., and Murphy, D., 
. `The Structure of a LISP System Using Two-level Storage', 
. $Comm.#ACM#10$, %23%1, p.#155-159, Mar.#1967.|)

.ref([Boy#75], |Boyer, R., and Moore, J, 
. `Proving theorems about LISP functions', 
. $Jour.#ACM#$, %21%1, p.#129-144, Mar.#1975.|)

.ref([Bur#76], |Burge, W., 
. $Recursive Programming Techniques$, 
. Addison Wesley, Reading, Mass., 1976.|)

.ref([Car#76],|Cartwright, R., 
. `A Practical and Formal Semantics and Verification System for TYPED LISP', Ph.D.#Thesis, 
. Computer Science Dept., Stanford Univ., 1976.|)

.ref([Che#70],|Cheney, C., 
. `A Nonrecursive List Compacting Algorithm', 
. $Comm.#ACM#13$, %211%1, p.#677-678, Nov.#1970.|)

.ref([Che#67], |Cheatham, T., 
. $The Theory & Construction of Compilers$, 
. Computer Associates, Wakefield,#Mass., 1967.|)

.ref([Chr#68] , |Christensen, C., 
. `An Example of the Manipulation of Directed Graphs in the AMBIT/G Programming 
. Language', 423-435,
. in $Interactive Systems for Experimental Applied Mathematics$, 
. Klerer, M., & Reinfelds, J. eds., Academic Press, 1968|)

.ref([Cl#77], |Clark, D., & Green, C., 
. `An Empirical Study of List Structure in LISP', 
. to appear in $Comm.#ACM$, 1977.|)

.ref([Chu#41], |Church, A., 
. $The Calculi of Lambda-conversion$, 
. Annals of Mathematics Studies, Princeton University Press, New Jersey, 1941.|)

.ref([Con#74],|Conrad, W., 
. `A Compactifying Garbage Collector for ECL's Non-homogeneous Heap',  
. Center for Research in Computing Technology, TR.#2-74, Harvard, Feb.#1974.|)

.ref([Con#73], |McDermott, D., and Sussman, G., 
. `The CONNIVER Reference Manual', 
. M.I.T. A.I.#Lab.#Memo#259a, Cambridge, Mass.,#1973.|)


.ref([Dar#73], |Darlington, J., and Burstall, R., 
. `A System which Automatically Improves Programs', 
. Proc. 3%8rd%1 Int. J. Conf. on A.I., Stanford, 1973.|)

.REF([Dav#76], |Davis, R.,
. `Deduction, Truth, and Computation', 
. M.S.#Thesis, Math.#Dept., San Jose State University, 1976.|)

.ref([DEC#69], |`PDP-10 Systems Reference Manual', 
. Digital Equipment Corporation, Maynard Mass., 1969.|)

.ref([Deu#73], |Deutsch, P., 
. `A LISP Machine With Very Compact Programs', 
. Proc. 3%8rd%1 Int. J. Conf. on A.I., Stanford, 1973.|)

.ref([Dif#71], |Diffie, W., 
. `Documentation of the Compiler', unpublished paper, 
. Stanford A.I. Lab., 1971.|)

.ref([Dij#72a], |Dijkstra, E., 
. `The Humble Programmer: 1972 ACM Turing Lecture', 
. $Comm.#ACM 15$, %210%1, p.#859-866, Oct#1972.|)

.ref([Dij#72], |Dijkstra, E.,
. `Notes on Structured Programming', 
. in $Structured Programming$, Dahl, O., and Hoare, C., eds., Academic Press, New York, 1972.|)

.ref([DSIPL], |Proceedings of a Symposium on Data Structures in Programming Languages, 
. $SIGPLAN Notices 6$, %22%1, Feb.#1971.|)

.ref([Dor#76], |Doran, R.,
. $Architecture of General Purpose Computers$, 
. to be published by Academic Press, New York.|)




.ref([EL1#74], |Wegbreit, B., 
. `ECL Programmer's Manual',  
. Center for Research in Computing Technology, TR#23-74, Harvard, Dec. 1974.|)


.ref([Fat#73], |Fateman, R., 
. `Reply to an Editorial', 
. $SIGSAM Bulletin$, No.#25, p.#9-11, Mar.#1973.|)

.ref([Fel#68],|Feldman, J., and Gries, D., 
. `Translator Writing Systems', 
. $Comm.#ACM 11$, %22%1, p.#77-113, Feb.#1968.|)

.ref([Fen#69], |Fenichel, R., and Yochelson, J., 
. `A LISP Garbage Collector for Virtual-memory Computer Systems', 
. $Comm.#ACM#12$, %211%1, p.#611-612, Nov.#1969.|)

.ref([Fin#76], |Finin, T., and Rutter, P., 
. `Different Fringe for Different Folk', 
. $SIGART Newsletter$, No.#60, p.#4-5, Nov.#1976.|)

.ref([Fis#72],|Fischer, M., 
. `Lambda Calculus Schemata', 
. ACM Conf. on Proving assertions about programs, $SIGPLAN Notices$, p.#104-109, Jan.#1972.|)

.ref([Fis#70],|Fisher, D., 
. `Control Structures for Programming Languages', Ph.D.#Thesis, 
. Dept. of Computer Science, Carnegie-Mellon University, 1970.|)
	
.ref([Fri#74], |Friedman, D.,
. $The Little LISPer$, 
. SRA, Menlo Park, 1974.|)

.ref([Fri#76b], |Friedman, D., and Wise, D., 
. `An Environment for Multiple-valued Recursive Procedures', 
. 2%8me%1 Colloque sur la Programation, Paris, Springer#Verlag, Berlin, 1976.|)

.ref([Fri#76a],|Friedman, D., and Wise, D., 
. `CONS Should Not Evaluate its Arguments', 
. Proc. 3%8rd%1 Int. Colloq. on Automata, Languages and Programming, Edinburgh Univ. Press, p.257-284, July#1976.|)



.ref([Gol#73], |Goldstein, I., 
. `Pretty Printing:#Converting List to Linear Structure', 
. M.I.T.#A.I.#Lab, Memo#279, Feb. 1973.|)

.ref([Goo#57], |Goodstein, R., 
. $Recursive Number Theory$, 
. North-Holland Pub. Co., Amsterdam, 1957.|)

.ref([Got#74],|Goto, E., 
. `Monocopy and Associative Algorithms in an Extended Lisp', 
. University of Tokyo, Japan, May 1974.|)

.ref([Gor#75], |Gordon, M., 
. `Towards a Semantic Theory of Dynamic Binding', 
. Stanford A.I. Lab. Memo#265, Stanford University, 1975.|)

.ref([Gor#73], |Gordon, M., 
. `Models of Pure LISP', Dept. of Machine Intelligence, 
. Experimental programming reports:#No.30, 
. University of Edinburgh, 1973.|)

.REF([Got#76],|Goto, E., and Kanada, Y., 
. `Recursive Hashed Data Structures with Applications to Polynomial Manipulations', 
. submitted to SYMSAC#76.|)

.REF([Got#xx],|Goto, E.,
.lisp machine proposal 
.|)

.REF([Gri#71],|Gries, D., 
. $Compiler Construction for Digital Computers$, 
. Wiley, New York, 1971.|)

.ref([Gre#74],|Greenblatt, R., 
. `The LISP Machine', M.I.T., Working paper No.#79, 
. Nov.#1974.|)

.ref([Gre#76], |Greussay, P., 
. `An Iterative LISP Solution to the Samefringe Problem', 
. $SIGART Newsletter$, No.#59, p.#14, Aug.#1976.|)

.ref([Gre#75], |Greussay, P., 
. `Manuel de Reference Provisoire:#LISP#T#1600', 
. Universite Paris-Vincennes, Feb.#1975.|)

.ref([Gre#76a], |Greussay, P., 
. `Iterative Interpretation of Tail-Recursive LISP Procedures',
. University of Vincennes, TR-20-76, Paris, Sep.#1976.|)

.REF([Gua#69], |Guard, J., Bennet, J., and Settle, L., 
. `Semi Automated Mathematics', 
. $JACM#16$, %21%1, p.#49-62, Jan.#1969.|)

.ref([Gun#76],|Gunji, T., 
. `Analysis of Hash Addressing Methods', 
. Department of Information Sciences, TR#76-03, Univ. of Tokyo, Japan, Jan. 1976.|)



.ref([Ham#69], |Hammer, M., 
. `Formal Definition of BASEL', Mass. Computer Associates, Inc., 
. CA-6908-1511, Wakefield, Mass., 1969.|)

.ref([Han#69], |Hansen, W., 
. `The Impact of Storage Management on Plex Processing Language Implementation', 
. Stanford Graphics Project, July#1969.|)

.ref([Han#71],|Hansen, W., 
. `Creation of Hierarchic Text With a Computer Display',
. Ph.D. Thesis, Computer Science Dept., Stanford Univ., June 1971.|)

.ref([Har#64], |Hart, T., and Evans, T., 
. `Notes on Implementing LISP for the M-460 Computer', p.#191-203
. in [Ber#64].|)

.ref([Har#75], |Howard, F., 
. `Documentation of Harvard  PDP-11 LISP', 
. unpublished documentation, 1975.|)

.ref([Hea#68],|Hearn, A., 
. `REDUCE User's Manual', 
. Stanford A.I.#Lab Memo 50, Stanford University, 1968.|)

.ref([Hen#76], |Henderson, P., and Morris, J., 
. `A Lazy Evaluator', 
. SIGPLAN-SIGACT Symposium on principles of programming languages, Altanta, p.95-103, Jan.#1976.|)

.ref([Hen#75],|von Henke, F., 
. `On the Representation of Data Structures in LCF With Applications to Program Generation', 
. Stanford A.I.#Lab. Memo#267, Sep.#1975.|)

.ref([Hew#75],|Hewitt, C., and Smith, B., 
. `Towards a Programming Apprentice', 
. $IEEE Trans. on Software Engineering$, SE-1, p.#26-45, Mar#1975.|)

.ref([Hew#72], |Hewitt, C., 
. `Description and Theoretical Analysis (using Schemata) of PLANNER', 
. M.I.T. A.I. Lab., TR-258, April 1972.|)

.ref([Hew#76],|Hewitt, C., 
. `Viewing Control  Structures as Patterns of Passing Messages',
. M.I.T.#A.I.#Lab, Working paper#92, April#1976.|)

.ref([Hew#74],|Hewitt, C., et. al., 
. `Behavioral Semantics of Non-recursive Control Structures',  
. Proc. Colloque sur la Programmation, B.#Robinet ed., in
. $Lecture Notes in Computer Science, No.#19$, p.#385-407, Springer Verlag, Berlin, 1974.|)

.ref([Hoa#73a], |Hoare, C.A.R., 
. `Hints on Programming Language Design', 
. Stanford A.I.#Lab Memo 224, Dec.#1973.|)

.ref([Hoa#69], |Hoare, C.A.R., 
. `An Axiomatic Basis for Computer Programming', 
. $Comm.#ACM 12$, %210%1, p.#576-580, Oct.#1969.|)

.ref([Hoa#73], |Hoare, C.A.R., 
. `Recursive Data Structures', 
. Stanford A.I.#Lab Memo 223, Oct.#1973.|)

.ref([Hop#69], |Hopcroft J., and Ullman, J., 
. $Formal Languages and their Relation to Automata$, 
. Addison-Wesley, Reading, Mass., 1969.|)


.ref([Ive#62], |Iverson, K.,
. $A Programming Language$,
. Wiley, New York, 1962.|)

.ref([Int#75], |Teitelman, W., 
. `INTERLISP Reference Manual',
. Xerox PARC, Palo Alto, 1975.|)


.ref([Kan#75],|Kanada, Y., 
. `Implementation of HLISP and Algebraic Manipulation Language REDUCE-2',  
. Information Sciences Lab., TR#75-01, Univ. of Tokyo, Japan, Jan. 1975.|)

.ref([Kni#74],|Knight, T.,
. `The CONS Microprocessor', M.I.T., Artificial Intelligence Working paper No.#80, . Cambrigde, Nov.#1974.|)


.ref([Knu#68], |Knuth, D., 
. $The Art of Computer Programming, Non-numerical Algorithms$,
. Vol.#1, Addison-Wesley, Reading, Mass., 1968.|)

.ref([Knu#72], |Knuth, D., 
. $The Art of Computer Programming, Searching and Sorting$,
. Vol.#3, Addison-Wesley, Reading, Mass., 1972.|)

.ref([Knu#74], |Knuth, D., 
. `Structured Programming With GO TO Statements', 
. $Computer Surveys 6$, 4, p.#261-301, Dec.#1974.|)




.ref([Joh#71],|Johnston, J., 
. `The Contour Model of Block Structured Processes', 
. p.#55-82 in [DSIPL].|)


.ref([Lan#64], |Landin, P., 
. `The Mechanical Evaluation of Expressions', 
. $Computer#Journal#6$, %24%1, p.#308-320, Apr.#1964.|)

.ref([Lan#66], |Landin, P., 
. `The Next 700 Programming Languages',
. $Comm.#ACM#9$, %23%1, p.#157-166, Mar.#1966.|)

.ref([LCF#72], |Milner, R., 
. `Logic for Computable Functions, Description of a Machine Implementation', 
. Stanford A.I.#Lab. Memo 169, 1972.|)
 
.ref([Lis#74], |Liskov, B., and Zilles, S., 
. `Programming With Abstract Data Structures', 
. Proc. of Symposium on Very high level languages, $SIGPLAN Notices$, Apr.#1974.|)

.ref([Lon#71], |London, R., 
. `Correctness of Two Compilers for a LISP Subset', 
. Stanford A.I.#Lab. Memo 151, Oct.,#1971.|)

.ref([Lug#73], |Lugger, J., and Melenk, H., 
. `Darstellung und Bearbeitung Umfangreicher LISP-programme', 
. $Angewandte Informatik$, p.#257-263, June#1973.|)
.ref([MAC#74],|Bogen, R., 
. `MACSYMA Reference Manual', 
. Project MAC, Mathlab Group, M.I.T., Cambridge, 1974.|)

.ref([Man#74], |Manna, Z., 
. $Mathematical Theory of Computation$, 
. McGraw-Hill, New#York, 1974.|)

.ref([McB#63],|McBeth, H. 
. `On the Reference Counter Method', (letter),
. $Comm. ACM#6$, %29%1, p.#575, Sep 1963.|)

.ref([McC#60], |McCarthy, J.,
. `Recursive Functions of Symbolic Expressions and Their Computation by Machine', 
. $Comm.#ACM$, p.#184-195, April#1960.|)

.ref([McC#63], |McCarthy, J., 
. $A Basis for a Mathematical Theory of Computation, 
. in Computer Programming and Formal Systems$, North Holland, Amsterdam, 1963.|)

.ref([McC#62], |McCarthy, J., 
. `Towards a Mathematical Science of Computation', 
. IFIPS Proceedings of Munich Conference 1962, North Holland, Amsterdam, 1963.|)

.ref([McC#76], |McCarthy, J., 
. $Recursive Programming in LISP$, CS206 notes,
. Stanford University, 1976.|)

.ref([McC#66], |McCarthy, J., 
. `A Formal Description of a Subset of ALGOL', 
. in $Formal Language Description Languages for Computer Programming$, North#Holland, Amsterdam, 1966.|)

.ref([McC#65], |McCarthy, J, et. al., 
. `LISP 1.5 Programmer's Manual', 
. M.I.T. Press, Cambridge, 1965.|)

.ref([McD#75], |McDermott, D., 
. `Very Large PLANNER-type Data Bases', 
. M.I.T.#A.I.#Lab Memo#339, Cambridge, Mass., Sep.#1975.|)

.ref([Men#64], |Mendelson, E., 
. $Introduction to Mathematical Logic$, 
. Van Nostrand, Princeton, New#Jersey, 1964.|)

.ref([Mli#73], |Smith, D., and  Enea, H., 
. `MLISP2', 
. Stanford A.I.#Lab Memo 195, Stanford Univ., 1973.|)

.ref([Min#70], |Minsky, M., 
. `Form and Content in Computer Science: 1970 ACM Turing Lecture', 
. $JACM#17$, %22%1, p.#197-215, Apr.#1970.|)

.ref([Mit#70], |Mitchell, J., 
. `The Design & Construction of Flexible & Efficient Interactive Programming Systems', Ph.D.#Thesis,
. Carnegie-Mellon Unversity, June 1970.|)

.ref([Mos#70], |Moses, J.,  
. `The Function of FUNCTION in LISP', 
. $SIGSAM Bulletin$, p.#13-27, July 1970.|)

.ref([Mos#74], |Moses, J.,  
. `MACSYMA#-# The Fifth Year',
. $SIGSAM Bulletin$, %28%1, %33%1, p.#105-110, Aug#1974.|)

.ref([Moor#75b], |Moore, J, 
. `Computational Logic: Structure Sharing and Proof of Program Properties Part II', 
. CSL#75-2, Xerox PARC, Palo Alto, Apr#1975.|)

.ref([Moor#74], |Moore, J, 
. `Introducing PROG to  the Pure LISP Theorem Prover', 
. CSL#74-3, Xerox PARC, Palo Alto, Dec#1974.|)

.ref([Moor#75a],|Moore, J, 
. `The INTERLISP Virtual Machine Specification', (in preparation), 
. Xerox PARC, Palo Alto, 1975.|)

.ref([Moo#74], |Moon, D., 
. `MacLISP Reference Manual', 
. Laboratory for Computer Science, M.I.T., Cambridge, Mass, 1974.|)

.ref([Mon#73], |Montangero, C., et al., 
. `An Extended LISP System for Complex Control-structure Programming', 
. University of Pisa, 1973.|)

.ref([Mon#75],|Montangero, C. et al., 
. `Information Management in Context Trees', 
. University of Pisa, N.I.#B75-21, Oct. 1975.|)

.ref([Mon#75a],|Montangero, C., et al., 
. `MAGMA-Lisp: A `Machine Language' for Artifical Intelligence', 
. Proc. 4%8th%1 Int. J. Conf. on A.I., Tbilisi, p.#556-561, Sep. 1975.|)

.ref([Mic#71],|Sussman, G., et al., 
. `Micro-PLANNER Reference Manual', 
. M.I.T., A.I.#Lab. Memo#203a, Cambridge, Mass., Dec#1971.|)

.ref([Mor#xx], |Morris, L., 
. `Advice on Structuring Compilers and Proving Them Correct', 
. p.#144-152, 19xx.|)

.ref([Mor#55], |Morris, C., 
. `Foundations of the Theory of Signs', 
. $International Encyclopedia of Unified Science$, Vol#1, No#2, University of Chicago press, 1955.|)

.ref([Mor#74],|Morris, J., 
. `Towards More Flexible Type Systems', 
. Proc. Colloque sur la Programmation, Paris, April 1974, p.#377-383, Springer Verlag, 
. Berlin, 1974.|)

.ref([Mor#68],|Morris, J., 
. `Lambda-calculus Models of Programming Languages',  
. Project MAC, M.I.T., MAC-TR57, Dec#1968.|)


.ref([Mot#76],|Motoyoshi, F., 
. `A Portable LISP Compiler on a Hypothetical LISP Machine',  
. Dept. of Info. Science, TR#76-5, University of Tokyo, Japan, Jan. 1976.|)

.ref([Mud#75],|Galley, S.W., and Pfister, G., 
. `The MDL Language', Programming Technology Division Doc.#SYS.11.01, 
. Project Mac, M.I.T., Cambridge, Mass., Nov.#1975.|)

.ref([Mul#76], |Muller, K., 
. `On the Feasibility of Concurrent Garbage Collection', 
. Ph.D. Thesis, University of Delft, 1976.|)


.ref([New#61], |Newell, A.,
. $Information Processing Language V Manual$, 
. Prentice Hall, Englewood Cliffs, New Jersey, 1961.|)

.ref([New#75], |Newey, M., 
. `Formal Semantics of LISP with Applications to Program Correctness', 
. Stanford A.I.# Lab Memo#257, Stanford Univ., Jan#1975.|)

.ref([Nor#70], |Nordstrom, M., et al., 
. `LISP F1 - A Fortran Implementation of LISP 1.5', 
. Computer Science Dept, Uppsala University, Sweden, 1970.|)

.ref([Nor#76], |Norman, E., 
. `Documentation for 1100 LISP Implementation', 
. unpublished paper, University of Wisconsin-Madison, 1976.|)

.ref([Pac#73], |Pacini, G., 
. `An Optimal Fix-point Computation Rule for a Simple Recursive Language', 
. University of Pisa, N.I.#B75-10, Oct. 1973.|)

.ref([Pag#76], |Page, R., 
. LISP for Fairchild F8, Private communication, 
. 1976.|)

.ref([Per#67], |Perlis, A., 
. `The Synthesis of Algorithmic Systems: 1966 ACM Turing Lecture', 
. $Jour.#ACM#14$, %21%1, p.#xxx-xxx, Jan.#1967.|)

.ref([Pop#68], |Burstall, R., et al., 
. $POP2 Papers$, 
. Oliver#&#Boyd, Edinburgh, 1968.|)

.ref([Pra#73], |Pratt, V., 
. `Top-down Operator Precedence', 
. Proceedings of the ACM Symposium on Principles of Programming, p.#41-51, 1973.|)

.ref([Pre#76a], |Prenner, C., 
. `Data structures for Spaghetti LISP', 
. unpublished notes, University of California, Berkeley, Calif, 1976.|)

.ref([Pre#72], |Prenner, C., 
. `Multi-path Control Structures for Programming Languages', 
. Ph.D. Thesis, Center for Research in Computing Technology,
. Harvard Univ., 1972.|)

.ref([Pre#76b], |Prenner, C., 
. `Implementation for Spaghetti EL1', 
. unpublished notes, University of California, Berkeley, Calif, 1976.|)

.ref([Org#71], |Organick, E., and Cleary, J., 
. `A Data Structure Model of the B6700 Computer System', 
. p.#83-145 in [DSIPL].|)

.ref([Qua#72],|Quam, L., and Diffie, W., 
. `Stanford LISP#1.6 Manual',   
. Stanford A.I.#Lab., Operating Note#28.7, Stanford Univ., 1972.|)


.ref([Qua#68], |Quam, L., 
. `SDIO Manual', 
. unpublished paper, Stanford, 1968.|)

.ref([QA4#72], |Rulifson, J., et.#al., 
. `QA4:#A Procedural Calculus for Intuitive Reasoning', 
. Stanford Research Institute, TN-73, Menlo Park, Cal., Nov.#1972.|)


.ref([Rey#72], |Reynolds, J., 
. `Definitional Interpreters for High-order Programming Languages', 
. Proceedings of the ACM National convention, 1972, p.#717-740, ACM, 1972.|)

.ref([Ric#74], |Rich, C., and Shrobe, H., 
. `Understanding LISP Programs:#Towards a Programming Apprentice', 
. M.I.T.#A.I.#Lab, Working paper#82, Dec.#1974.|)

.ref([Ris#73], |Risch, T., 
. `REMREC#-#A Program for Automatic Recursion Removal in LISP', 
. Datalogilaboratoriet, DLU#73/24, Uppsala Univ., Nov.#1973.|)

.ref([Riv#76], |Rivest, R., 
. `On Self-organizing Sequential Search  Heuristics', 
. $Comm. ACM 19$, %22%1, p.#63-67, Feb.#1976.|)

.ref([Rob#65], |Robinson, J., 
. `A Machine-oriented Logic Based on the Resolution Principle', 
. $Journal ACM 12$, %21%1, p.#23-41, Jan#1965.|)

.ref([Roc#71],|Rochfeld, A., 
. `New LISP Techniques for a Paging Environment', 
. $Comm. ACM 14$, %212%1, p.#791-795, Dec 1971.|)

.ref([Rog#67], |Rogers, H., 
. $Theory of Recursive Functions & Effective Computability$, 
. McGraw-Hill, New#York, 1967.|)

.ref([Sam#75],|Samet, H., 
. `Automatically Proving the Correctness of Translations Involving Optimized Code',  
. Stanford A.I.#Lab. Memo#259, May#1975.|)

.ref([San#75],|Sandewall, E., 
. `Some Observations on Conceptual Programming', 
. Computer Science Dept., Uppsala University, Sweden, 1975.|)

.ref([San#75a],|Sandewall, E., 
. `Ideas About Management of LISP Data Bases',  
. M.I.T. A.I. Lab., Memo#332, May#1975.|)

.ref([San#76],|Sandewall, E., 
. `Programming in an Interactive Environment: The LISP Experience', 
. Linkoping University, Sweden, 1976.|)

.ref([Sau#64], |Saunders, R., 
. `The LISP System for the Q-32 Computer', 
. p.#220-231 in [Ber#64].|)

.ref([Sch#67], |Schorr, H., and Waite, W., 
. `An Efficient Machine-independent Procedure for Garbage Collection in Various List Structures', 
. $Comm.#ACM#10$, %28%1, p.#501-506, Aug.#1967.|)

.ref([Sco#70], |Scott, D., 
. `Outline of a Mathematical Theory of Computation',  
. Oxford University Computing Labs, PRG-2, Oxford University, 1970.|)

.ref([Sco#72], |Scott, D., 
. `Mathematical Concepts in Programming Languages', 
. AFIPS Conference Proceedings, Vol#40, p.#225-234, 1972.|)

.ref([Sco#73], |Scott, D., 
. `Models for various type-free calculi', 
. in $Logic, Methodology, and Philosophy of Science#IV$, North Holland, p.#157-187, 1973.|)

.ref([Sik#76], |Siklossy, L., 
. $Let's Talk LISP$, 
. Prentice Hall, Englewood Cliffs, New Jersey, 1976.|)

.ref([Str#67],|Strachey, C., 
. `Fundamental Concepts in Programming Languages', 
. NATO Conference, Copenhagen, 1967.|)

.ref([Ste#pc], |Steele, G., 
. private communications.
.|)

.ref([Ste#76b], |Steele, G., and  Sussman, G.,
. `LAMBDA:#The Ultimate Imperative', 
. M.I.T.#A.I.#Memo#353, Mar.#1976.|)

.ref([Ste#76c], |Steele, G., 
. `LAMBDA:#The Ultimate Declarative', 
. M.I.T.#A.I.#Memo#379, Oct.#1976.|)

.ref([Ste#73], |Steele, G., 
. `BIBOP LISP Memo', 
. unpublished MIT paper, 1973.|)

.ref([Ste#76a], |Steele, G.,
. `Multiprocessing Compactifying Garbage Collection', 
. $Comm.#ACM#18$, %29%1, p.#495-508, Sep.#1967.|)

.ref([Stei#74], |Steiger, R., 
. `Actor Machine Architecture', M.S.#Thesis, 
. M.I.T., 1974.|)

.ref([Str#73], |Strachey, C.,
. `Varieties of Programming Languages',  
. Oxford University Computing Labs, PRG-10, Oxford University, 1973.|)

.ref([Sto#75], |Stoyan, H., 
. `Comparison of Two LISP Compilers:#Stanford Versus DOS/ES-LISP', 
. $Elektronische Informationsverarbeitung und Kybernetik#11$, p.#371-375, 1975.|)

.ref([Sus#75], |Sussman, G., and  Steele, G., 
. `SCHEME: an Interpreter for Extended Lambda Calculus', 
. M.I.T.#A.I.#Memo#349, Dec.#1975.|)

.ref([Sus#76], |Sussman, G., and  Steele, G., 
. `SCHEME Flash #1', 
. M.I.T.#A.I.#Lab., Jan.#1976.|)

.ref([Str#74],|Foy, N., 
. `The Words Games of the Night Bird: Interview with C. Strachey', 
. $Computing#Europe$, p.#10-11, Aug#15,#1974.|)


.ref([Ten#76], |Tennent, R., 
. `The Denotational Semantics of Programming Languages', 
. $Comm.#ACM#19$, %28%1, p.#437-453, Aug.#1976.|)

.ref([Tei#72], |Teitelman, W., 
. `Automated Programmering#-#The Programmer's Assistant',
. Proceedings of the Fall Joint Computer Conference, Dec.#1972.|)

.ref([Ter#75],|Terashima, M., 
. `Algorithms Used in an Implementation of HLISP', 
. Information Sciences Lab., TR#75-03, Univ. of Tokyo, Japan, Jan. 1975.|)

.ref([Vui#74], |Vuillemin, J., 
. `Correct and Optimal Implementations of Recursion in a Simple Programming Language', 
. $Journal of Computer and System Science$, Vol#9, No#3, Dec#1974.|)
.ref([Wad#71], |Wadsworth, C., 
. `Semantics and Pragmatics of the Lambda-calculus', Ph.D. Thesis, 
. Oxford University, 1971.|)

.ref([Wad#74], |Wadsworth, C., 
.continuations paper
.|)

.ref([Wad#74a], |Wadsworth, C., 
. The Relation Between Lambda-expressions and Their Denotations', unpublished paper, 
. Systems and Info. Science Dept, Syracuse Univ., 1974.|)

.ref([Wan#75], |Wang, P., 
. `MACSYMA#-#A Symbolic Manipulation System', 
. Proceedings of International Computer Symposium, Vol.#1, p.#103-109, 1975.|)

.ref([War#74], |Ward, S., 
. `Functional Domains of Applicative Languages', Ph.D.#Thesis,  
. M.I.T., MAC#TR-136, Cambridge, Sep. 1974.|)

.ref([Wegb#72], |Wegbreit, B., 
. `A Generalized Compactifying Garbage Collector', 
. $Computer#Journal#15$, %23%1, p.#204-208, Aug#1972.|)

.ref([Wegb#71],|Wegbreit, B., 
. `The ECL Programming System', 
. Proceedings AFIPS 1971 FJCC, Vol#39, AFIPS Press, Mondale, New Jersey, p.#253-262, 1971.|)

.ref([Wegb#74],|Wegbreit, B., 
. `The Treatment of Data Types in EL1', 
. $Comm. ACM 17$, %25%1, p.#251-264, May 1974.|)

.ref([Wegb#75],|Wegbreit, B., 
. `Retrieval From  Context Trees', 
. $Information Processing Letters, 3$, %24%1, p.#119-120, March 1975.|)

.ref([Wegb#70], |Wegbreit, B., 
. `Studies in Extensible Programming Languages', 
. Ph.D. Thesis, Harvard University, Cambridge, Mass.,1970.|)

.ref([Weg#70],|Wegner, P., 
. `Three Computer Cultures - Computer Technology, Computer Mathematics & Computer Science', 
. in $Advances in Computers$, %210%1, 1970.|)

.ref([Weg#71], |Wegner, P., 
. `Data Structure Models for Programming Languages', 
. p.#1-54 in [DSIPL].|)

.REF([Weg#68],|Wegner, P.,
. $Programming Languages, Information Structures and Machine Organization$, 
. McGraw-Hill, New York, 1968.|)

.REF([Weg#72], |Wegner, P., 
. `The Vienna Definition Language', 
. $Computing Surveys$, Vol#4, No#1, p.#5-63, Mar#1972.|)

.ref([Weis#67], |Weismann, C.,
. `LISP 1.5 Primer', 
. Dickenson Press, Belmont, 1967.|)

.ref([Wei#68], |Weizenbaum, J., 
. `The FUNARG Problem Explained', 
. unpublished memorandum, M.I.T., Cambridge, Mass., 1968.|)

.ref([Wei#62],|Weizenbaum, J., 
. `Knotted List Structures', 
. $Comm. ACM#5$, %213%1, p.#161-165, Mar 1962.|)

.ref([Wei#63],|Weizenbaum, J., 
. `Symmetric List Processor', 
. $Comm. ACM#6$, %29%1, p.#524-544, Sep 1963.|)

.ref([Win#75], |Winograd, T., 
. `Breaking the Complexity Barrier#(again)',
. $ACM SIGPLAN Notes 10$, %21%1, p.#13-30, Jan.#1975.|)

.ref([Wis#75],|Wise, D., et. al., 
. `Boolean-valued Loops', 
. $BIT$ %215%1 p.#431-451, 1975.|)

.ref([Zil#70], |Zilles, S., 
. `An Expansion of the Data Structuring Capabilities in PAL', 
. M.S. Thesis, MIT, Jun#1970.|)
.END